10.50 a. Prove that in a round robin tournament it is always possible to arrange the players in an order pi1 , pi2 , . . . , piN such that for all 1 ≤ j < N, pij has won the match against pij+1 . b. Give an O(N logN) algorithm to find one such arrangement. Your algorithm may serve as a proof for part (a). . - | |
| View Solution | |
| << Back | Next >> |